Superposition with Lambdas
نویسندگان
چکیده
Abstract We designed a superposition calculus for clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on $$\beta \eta $$ β η -equivalence classes $$\lambda λ -terms and rely unification to achieve refutational completeness. implemented the in Zipperposition prover evaluated it TPTP Isabelle benchmarks. results suggest is suitable basis reasoning.
منابع مشابه
Lambdas and Vectors
terms that can be used as translations of linguistic expressions have a lot in common with the Logical Forms of these expressions and the lambda binders in them give easy ways for treating long distance dependencies. The use of lambda terms also makes standard ways of dealing with coordination accessible to distributional semantics. The paper will provide extensive discussion of this and will g...
متن کاملParallelism with Asynchronous Lambdas on Fiasco.OC / L4Re
Erklärung Hiermit erkläre ich, dass ich diese Arbeit selbständig erstellt und keine anderen als die angegebenen Hilfsmittel verwendet habe. Task Grand Central Dispatch (GCD) provides modern applications an easy to use abstraction for task level parallelism: blocks and dispatch queues. Its implementation is based on threads and scheduler activations offered by the operating system. The goal of t...
متن کاملLambdas, Arrays and Quantifiers
Satisfiability Modulo Theories (SMT) refers to the problem of deciding the satisfiability of a first-order formula with respect to one or more first-order theories. In many applications of hardware and software verification, SMT solvers are employed as back-end engine to solve complex verification tasks that usually combine multiple theories, such as the theory of fixed-size bit-vectors and the...
متن کاملClash of the Lambdas
The introduction of lambdas in Java 8 completes the slate of statically-typed, mainstream languages with both object-oriented and functional features. The main motivation for lambdas in Java has been to facilitate stream-based declarative APIs, and, therefore, easier parallelism. In this paper, we evaluate the performance impact of lambda abstraction employed in stream processing, for a variety...
متن کاملLanguage, Lambdas, and Logic
type phrase structure semantics features (d = 1) (d = 2) (d = 3) s νt st φt np νt e φt n νt e(st) φt Table 1: Concretizations of abstract types. The signs in (41) can be combined with arguments such as the simple np in (42). This will lead to untensed sentences such as (43),6 which was obtained by pointwise application of (41a) to (42). (42) 〈Mary,mary, λf.arc(f, cat,N) ∧ arc(f, agr, 3sg)〉 (43)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2021
ISSN: ['0168-7433', '1573-0670']
DOI: https://doi.org/10.1007/s10817-021-09595-y